Automatic Homographic Registration of a Pair of Images, with A Contrario Elimination of Outliers

The RANSAC [2] algorithm (RANdom SAmple Consensus) is a robust method to estimate parameters of a model fitting the data, in presence of outliers among the data. Its random nature is due only to complexity considerations. It iteratively extracts a random sample out of all data, of minimal size sufficient to estimate the parameters. At each such trial, the number of inliers (data that fits the model within an acceptable error threshold) is counted. In the end, the set of parameters maximizing the number of inliers is accepted. The variant proposed by Moisan and Stival [7] consists in introducing an a contrario [1] criterion to avoid the hard thresholds for inlier/outlier discrimination. It has three consequences: 1. The threshold for inlier/outlier discrimination is adaptive, it does not need to be fixed. 2. It gives a decision on the adequacy of the final model: it does not provide a wrong set of parameters if it does not have enough confidence. 3. The procedure to draw a new sample can be amended as soon as one set of parameters is deemed meaningful: the new sample can be drawn among the inliers of this model. In this particular instantiation, we apply it to the estimation of the homography registering two images of the same scene. The homography is an 8-parameter model arising in two situations when using a pinhole camera: the scene is planar (a painting, a facade, etc.) or the viewpoint location is fixed (pure rotation around the optical center). When the homography is found, it is used to stitch the images in the coordinate frame of the second image and build a panorama. The point correspondences between images are computed by the SIFT [5] algorithm. Source Code The source code to reproduce the same results as the demo can be found on the article web page (http://dx.doi.org/10.5201/ipol.2012.mmm-oh). Notice that due to the random component of ORSA, different runs may yield slightly different results. You may also observe slower runs on your machine for large images, as the mosaic construction parts use the multiple cores via OpenMP (http://openmp.org/), and the IPOL server has probably more cores (32 currently). Supplementary Material Lionel Moisan, Pierre Moulon, Pascal Monasse, Automatic Homographic Registration of a Pair of Images, with A Contrario Elimination of Outliers, Image Processing On Line, 2 (2012), pp. 56–73. http://dx.doi.org/10.5201/ipol.2012.mmm-oh Automatic Homographic Registration of a Pair of Images, with A Contrario Elimination of Outliers A first implementation by Moisan and Stival of the method as a Megawave2 (http://megawave. cmla.ens-cachan.fr/) module, called stereomatch.c, can be found in [7]. Possible updates, bug fixes, or enhanced versions of the code can be found at http:// imagine.enpc.fr/~moulonp/AC_Ransac.html. Notice however that such versions are not necessarily peer-reviewed.